package LinkList;

import java.util.List;

public class MySingleList implements  IList{
    static  class ListNode{
        public int val;
        public ListNode next;

        public ListNode(int val) {
            this.val = val;
        }
    }
    public  ListNode head;
    public void createList(){
        ListNode node = new ListNode(12);
        ListNode node1 = new ListNode(23);
        ListNode node2 = new ListNode(34);
        ListNode node3 = new ListNode(45);
        ListNode node4 = new ListNode(56);
        node.next =node1;
        node1.next =node2;
        node2.next =node3;
        node3.next =node4;
        this.head =node;
    }
    @Override
    public void display() {
        while(head!=null){
            System.out.print(head.val+" ");
            head =head.next;
        }
        System.out.println();
    }
    @Override
    public int size() {
        int len =0;
        ListNode cur =head;
        while(cur !=null){
            len++;
            cur = cur.next;
        }
        return len;
    }
    @Override
    public void addFirst(int data) {
        ListNode node =new ListNode(data);
        node.next =head;
        head =node;
    }

    @Override
    public void addLast(int data) {
        ListNode node =new ListNode(data);
        ListNode cur =head;
        if(cur==null){
            head=node;
            return ;
        }
        while(cur.next !=null){
            cur=cur.next;
        }
        cur.next =node;
    }

    @Override
    public void addIndex(int index, int data) {
        ListNode node =new ListNode(data);
        ListNode cur =head;
        int len =size();
        if(index <0||index> len){
            System.out.println("index位置不合法");
            return;
        }
        //前面插入
        if(index==0){
            addFirst(data);
            return;
        }
        //中间插入
        while(cur!=null){
            cur =cur.next;
            index--;
        }
        node.next =cur.next;
        cur.next =node;
    }

    @Override
    public boolean contains(int key) {
        ListNode cur =head;
        while(cur !=null){
            if(cur.val==key){
                return true;
            }
            cur =cur.next;
        }
        return false;
    }

    @Override
    public void remove(int key) {
        if(head==null){
            return;
        }
        if(head.val==key){
            head =head.next;
            return;
        }
        ListNode cur =findNodeOfKey(key);
        if(cur==null){
            return ;
        }
        ListNode del =cur.next;
        cur.next =del.next;
    }
    private  ListNode findNodeOfKey(int key){
        ListNode cur =head;
        while(cur !=null){
            if(cur.next.val==key){
                return cur;
            }
            cur =cur.next;
        }
        return null;
    }
    @Override
    public void removeAllKey(int key) {

    }
    @Override
    public void clear() {

    }

}
